Expansive Motions and the Polytope of Pointed Pseudo-Triangulations
نویسندگان
چکیده
We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its 1-skeleton is the graph whose vertices are the pointed pseudo-triangulations of the point set and whose edges are flips of interior pseudo-triangulation edges. For points in convex position we obtain a new realization of the associahedron, i.e., a geometric representation of the set of triangulations of an n-gon, or of the set of binary trees on n vertices, or of many other combinatorial objects that are counted by the Catalan numbers. By considering the 1-dimensional version of the polytope of constrained expansive motions we obtain a second distinct realization of the associahedron as a perturbation of the positive cell in a Coxeter arrangement. Our methods produce as a by-product a new proof that every simple polygon or polygonal arc in the plane has expansive motions, a key step in the proofs of the Carpenter’s Rule Theorem by Connelly, Demaine and Rote (2000) and by Streinu (2000).
منابع مشابه
On extreme points of the PPT Polytope
The polytope of pointed pseudo triangulations was described in [RSS01]. This polytope is a combinatorial tool to observe all possible pseudo triangulations of a certain point set. Each point of the polytope refers to one possible pseudo triangulation of the point set. To polytope vertices are connected by an edge if their pseudo triangulations just differ in one edge-flip. Once we have a PPT-po...
متن کاملSingle-Vertex Origami and Spherical Expansive Motions
We prove that all single-vertex origami shapes are reachable from the open flat state via simple, non-crossing motions. We also consider conical paper, where the total sum of the cone angles centered at the origami vertex is not 2π. For an angle sum less than 2π, the configuration space of origami shapes compatible with the given metric has two components, and within each component, a shape can...
متن کاملOn numbers of pseudo-triangulations
We study the maximum numbers of pseudo-triangulations and pointed pseudotriangulations that can be embedded over a specific set of points in the plane or contained in a specific triangulation. We derive the bounds O(5.45 ) and Ω(2.41 ) for the maximum number of pointed pseudo-triangulations that can be contained in a specific triangulation over a set of N points. For the number of all pseudo-tr...
متن کاملCompatible pointed pseudo-triangulations
For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjoint compatible pointed pseudotriangulations, that is, their union is a triangulation of S. In contrast, we show that there are point sets S and pointed pseudo-triangulations T such that there exists no pointed pseudo-t...
متن کامل